Detecting Overlapping Communities in Social Networks using Deep Learning

Authors

  • A. A. Pouyan Department of Computer Engineering, Shahrood University of Technology, Shahrood, Iran.
  • S. M. M Salehi Department of Computer Engineering, Shahrood University of Technology, Shahrood, Iran.
Abstract:

In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping and disjoint detection of community in networks. In recent years, many researchers have concentrated on feature learning and network embedding methods for node clustering. These methods map the network into a lower-dimensional representation space. We propose a model in this research for learning graph representation using deep neural networks. In this method, a nonlinear embedding of the original graph is fed to stacked auto-encoders for learning the model. Then an overlapping clustering algorithm is performed to obtain overlapping communities. The effectiveness of the proposed model is investigated by conducting experiments on standard benchmarks and real-world datasets of varying sizes. Empirical results exhibit that the presented method outperforms some popular community detection methods.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Overlapping Communities in Social Networks

Complex networks can be typically broken down into groups or modules. Discovering this “community structure” is an important step in studying the large-scale structure of networks. Many algorithms have been proposed for community detection and benchmarks have been created to evaluate their performance. Typically algorithms for community detection either partition the graph (nonoverlapping commu...

full text

Overlapping communities in social networks

Identifying communities is essential for understanding the dynamics of a social network. The prevailing approach to the problem of community discovery is to partition the network into disjoint groups of members that exhibit a high degree of internal communication. This approach ignores the possibility that an individual may belong to two or more groups. Increasingly, researchers have begun to e...

full text

Efficiently detecting overlapping communities using seeding and semi-supervised learning

Seeding then expanding is a commonly used scheme to discover overlapping communities from a network. Most seeding methods existed are either too complexity to scale to large networks or too simple to select high-quality seeds; and the non-principled functions used by most expanding methods lead the poor performances when applied them on diverse networks. This paper proposes a new method which t...

full text

Detecting Overlapping Link Communities

We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of communities. The complexity of the clustering task requires the application of a memetic algorithm that combines probabilistic evolutionary strategies with deterministic local searches. In Part 2 we will present results ...

full text

Detecting Communities in Social Networks Using Max-Min Modularity

Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common property of these networks is their community structure, considered as clusters of densely connected groups of vertices, with only sparser connections between groups. The identification of such communities relies on so...

full text

Detecting Communities in Social Networks Using Local Information

Much structured data of scientific interest can be represented as networks, where sets of nodes or vertices are joined together in pairs by links or edges. Although these networks may belong to different research areas, there is one property that many of them do have in common: the network community structure. There has been much recent research on identifying communities in networks. However, ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 33  issue 3

pages  366- 376

publication date 2020-03-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023